LOTSIZE OPTIMIZATION LEADING TO A p-MEDIAN PROBLEM WITH CARDINALITIES
نویسنده
چکیده
We consider the problem of approximating the branch and size dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available lot-types. We propose a formalized model which arises from a practical cooperation with an industry partner. Besides an integer linear programming formulation and a primal heuristic for this problem we also consider a more abstract version which we relate to several other classical optimization problems like the p-median problem, the facility location problem or the matching problem.
منابع مشابه
A Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملPERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS
The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...
متن کاملJoint Optimization of Star P-hub Median Problem and Seat Inventory Control Decisions Considering a Hybrid Routing Transportation System
In this paper, we study the problem of integrated capacitated hub location problem and seat inventory control considering concept and techniques of revenue management. We consider an airline company maximizes its revenue by utilizing the best network topology and providing proper booking limits for all itineraries and fare classes. The transportation system arises in the form of a star/star net...
متن کاملAn Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملA Signal Processing Approach to Estimate Underwater Network Cardinalities with Lower Complexity
An inspection of signal processing approach in order to estimate underwater network cardinalities is conducted in this research. A matter of key prominence for underwater network is its cardinality estimation as the number of active cardinalities varies several times due to numerous natural and artificial reasons due to harsh underwater circumstances. So, a proper estimation technique is mandat...
متن کامل